Recolouring homomorphisms to triangle-free reflexive graphs

For a graph H, the H-recolouring problem \({\text {Recol}}(H)\) asks, for two given homomorphisms from G to if one can get between them by sequence of H in which consecutive differ on only vertex. We show that, and are reflexive is triangle-free, then this be solved polynomial time. This shows, at same time, that closely related H-reconfiguration {Recon}}(H)\) deciding whether component Hom-graph {{Hom}}}(G,H)\), time triangle-free graphs H.